Correct Readers for the Incremental Construction of Millstream Configurations by Graph Transformation
نویسندگان
چکیده
Millstream systems have been proposed as a non-hierarchical method for modelling natural language. Millstream configurations represent and connect multiple structural aspects of sentences. We present a method by which the Millstream configurations corresponding to a sentence are constructed. The construction is incremental, that is, it proceeds as the sentence is being read and is complete when the end of the sentence is reached. It is based on graph transformations and a lexicon which associates words with rules for the graph transformations.
منابع مشابه
Incremental Construction of Millstream Configurations Using Graph Transformation
Millstream systems are a non-hierarchical model of natural language. We describe an incremental method for building Millstream configurations while reading a sentence. This method is based on a lexicon associating words and graph transformation rules.
متن کاملGraph transformation for incremental natural language analysis
Millstream systems have been proposed as a non-hierarchical method for modelling natural language. Millstream configurations represent and connect multiple structural aspects of sentences. We present a method by which the Millstream configurations corresponding to a sentence are constructed. The construction is incremental, that is, it proceeds as the sentence is being read and is complete when...
متن کاملA Prototype Implementation of Incremental Millstream Systems
This thesis is concerned with a mathematical framework for describing sentences of natural language, called Millstream system. The main goal was to develop a prototype that simulates Millstream systems in an incremental fashion using graph transformations, based on an article [5] mainly written by people in the research group Natural and Formal Language at Umeå University. The rst step was to i...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملThe Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application
In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...
متن کامل